On the Number of Cliques in Graphs with a Forbidden Subdivision or Immersion
نویسندگان
چکیده
منابع مشابه
Number of Cliques in Graphs with a Forbidden Subdivision
We prove that for all positive integers t, every nvertex graph with no Kt-subdivision has at most 2 n cliques. We also prove that asymptotically, such graphs contain at most 2n cliques, where o(1) tends to zero as t tends to infinity. This strongly answers a question of D. Wood asking if the number of cliques in n-vertex graphs with no Kt-minor is at most 2 n for some constant c.
متن کاملOn the number of cliques in graphs with a forbidden minor
Reed and Wood and independently Norine, Seymour, Thomas, and Wollan proved that for each positive integer t there is a constant c(t) such that every graph on n vertices with no Kt-minor has at most c(t)n cliques. Wood asked in 2007 if we can take c(t) = c for some absolute constant c. This question was recently answered affirmatively by Lee and Oum. In this paper, we determine the exponential c...
متن کاملTotal Roman domination subdivision number in graphs
A {em Roman dominating function} on a graph $G$ is a function $f:V(G)rightarrow {0,1,2}$ satisfying the condition that every vertex $u$ for which $f(u)=0$ is adjacent to at least one vertex $v$ for which $f(v)=2$. A {em total Roman dominating function} is a Roman dominating function with the additional property that the subgraph of $G$ induced by the set of all vertices of positive weight has n...
متن کاملon the number of cliques and cycles in graphs
we give a new recursive method to compute the number of cliques and cycles of a graph. this method is related, respectively to the number of disjoint cliques in the complement graph and to the sum of permanent function over all principal minors of the adjacency matrix of the graph. in particular, let $g$ be a graph and let $overline {g}$ be its complement, then given the chromatic polynomial of...
متن کاملOn the Number of Cliques and Cycles in Graphs
We give a new recursive method to compute the number of cliques and cycles of a graph. This method is related, respectively to the number of disjoint cliques in the complement graph and to the sum of permanent function over all principal minors of the adjacency matrix of the graph. In particular, let G be a graph and let G be its complement, then given the chromatic polynomial of G, we give a r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 2020
ISSN: 0895-4801,1095-7146
DOI: 10.1137/18m1206126